21B - Intersection - CodeForces Solution


implementation math *2000

Please click on ads to support us..

Python Code:

a1, b1, c1 = map(int, input().split())
a2, b2, c2  = map(int, input().split())
if a1*b2 == a2*b1:
    if ((not a1 and not b1 and c1 ) or (not a2 and not b2 and c2)):
        print(0)
    elif (a1*c2 == a2*c1) and (c1*b2 == c2*b1):
        print(-1)
    else:
        print(0)
else:
    print(1)


Comments

Submit
0 Comments
More Questions

892A - Greed
32A - Reconnaissance
1236D - Alice and the Doll
1207B - Square Filling
1676D - X-Sum
1679A - AvtoBus
1549A - Gregor and Cryptography
918C - The Monster
4B - Before an Exam
545B - Equidistant String
1244C - The Football Season
1696B - NIT Destroys the Universe
1674A - Number Transformation
1244E - Minimizing Difference
1688A - Cirno's Perfect Bitmasks Classroom
219A - k-String
952A - Quirky Quantifiers
451B - Sort the Array
1505H - L BREAK into program
171E - MYSTERIOUS LANGUAGE
630D - Hexagons
1690D - Black and White Stripe
1688D - The Enchanted Forest
1674C - Infinite Replacement
712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC